Coupon Collector Problem for Non-Uniform Coupons and Random Quotas
نویسندگان
چکیده
We extend the classical coupon collector problem to find the expected number of selections needed to collect mi (possible random) copies of coupon i, when the distribution of the coupons is not necessarily equally likely. Upper and lower bounds which provide limiting asymptotics are also obtained for the expected number of selections needed to fulfill a random quota for each coupon.
منابع مشابه
Coupon Collecting with Quotas
We analyze a variant of the coupon collector’s problem, in which the probabilities of obtaining coupons and the numbers of coupons in a collection may be non-uniform. We obtain a finite expression for the generating function of the probabilities to complete a collection and show how this generalizes several previous results about the coupon collector’s problem. Also, we provide applications abo...
متن کاملThe weighted words collector
Motivated by applications in bioinformatics, we consider the word collector problem, i.e. the expected number of calls to a random weighted generator of words of length n before the full collection is obtained. The originality of this instance of the non-uniform coupon collector lies in the, potentially large, multiplicity of the words/coupons of a given probability/composition. We obtain a gen...
متن کاملNew Results on a Generalized Coupon Collector Problem Using Markov Chains
We study in this paper a generalized coupon collector problem, which consists in determining the distribution and the moments of the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we...
متن کاملOptimization results for a generalized coupon collector problem
We study in this paper a generalized coupon collector problem, which consists in analyzing the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we prove that the almost uniform distrib...
متن کاملCollecting Coupons with Random Initial Stake
Motivated by a problem in the theory of randomized search heuristics, we give a very precise analysis for the coupon collector problem where the collector starts with a random set of coupons (chosen uniformly from all sets). We show that the expected number of rounds until we have a coupon of each type is nHn/2 − 1/2± o(1), where Hn/2 denotes the (n/2)th harmonic number when n is even, and Hn/2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013